Extended Superposed Quantum State Initialization Using Disjoint Prime Implicants
نویسندگان
چکیده
Extended Superposed Quantum State Initialization Using Disjoint Prime Implicants (ESQUID) is a new algorithm for generating quantum arrays for the purpose of initializing a desired quantum superposition. The quantum arrays generated by this algorithm almost always use fewer gates than other algorithms and in the worst case use the same number of gates. These improvements are achieved by allowing certain parts of the quantum superposition that cannot be initialized directly by the algorithm to be initialized using special circuits. This allows more terms in the quantum superposition to be initialized at the same time which decreases the number of gates required by the generated quantum array.
منابع مشابه
Prime Implicates and Prime Implicants in Modal Logic: Extended and Revised Version
The purpose of this paper is to examine how the propositional notions of prime implicates and prime implicants might be appropriately extended to the modal logic K. We begin the paper by considering a number of potential definitions of clauses and terms for K. The different definitions are evaluated with respect to a set of syntactic, semantic, and complexity-theoretic properties characteristic...
متن کاملPrime and Non-prime Implicants in the Minimization of Multiple-valued Logic Functions
We investigate minimal sum-of-products expressions for multiple-valued logic functions for realization by programmable logic arrays. Our focus is on expressions where product terms consist of the MIN of interval literals on input variables and are combined using one of two operations SUM or MAX. In binary logic, the question of whether or not prime implicants are sufficient to optimally realize...
متن کاملAn Incremental Method for Generating Prime Implicants/Impicates
Given the recent investigation of Clause Management Systems (CMSs) for Artificial Intelligence applications, there is an urgent need for art efficient incremental method for generating prime implicants. Given a set of clauses 5 c, a set of prime implicants 1I of ~ and a clause C, the problem can be formulated as finding the set of prime implicaate for II t.J {C). Intuitively, the property of im...
متن کاملComputation of Prime Implicants Using Matrix and Paths
In this paper, an efficient algorithm to compute the set of prime implicants of a prepositional formula in Conjunc-tive Normal Form (CNF) is presented. The proposed algorithm uses a concept of representing the formula as a bi-nary matrix and computing paths through the matrix as implicants. The algorithm finds the prime implicants as theprime paths using the divide-and-conquer techn...
متن کاملA New Implicit Graph Based Prime and Essential Prime Computation Technique
Implicit set manipulation techniques based on binary decision diagrams (BDD) have made possible the verification of finite state machines with state graphs too large to be built. More recently, it has been shown that these techniques could be used with success to compute the sets of prime and essential prime implicants of Boolean functions for which these sets are much too large to be explicitl...
متن کامل